A polylogarithmic approximation of the minimum bisection
نویسندگان
چکیده
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n=2. The bisection cost is the number of edges connecting the two sets. Finding the bisection of minimum cost is NP-hard. We present an algorithm that finds a bisection whose cost is within ratio of O(log2 n) from the optimal. For graphs excluding any fixed graph as a minor (e.g. planar graphs) we obtain an improved approximation ratio of O(logn). The previously known approximation ratio for bisection was roughly pn.
منابع مشابه
Coping with Np-hardness: Approximating Minimum Bisection and Heuristics for Maximum Clique 2 Approximating Minimum Bisection 13 1.2 Approximation Algorithms
Many important optimization problems are known to be NP-hard. That is, unless P = NP, there is no polynomial time algorithm that optimally solves these problems on every input instance. We study algorithmic ways for \coping" with NP-hard optimization problems. One possible approach for coping with the NP-hardness is to relax the requirement for exact solution, and devise approximation algorithm...
متن کاملApproximating the Minimum Bisection Size
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n=2. The bisection size is the number of edges connecting the two sets. Finding the bisection of minimum size is NP-hard. We present an algorithm that nds a bisection that is within O(p n log n) of optimal. No sublinear approximation ratio for bisection was previously known.
متن کاملA polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity
The distance to monotonicity of a sequence of n numbers is the minimum number of entries whose deletion leaves an increasing sequence. We give the first deterministic streaming algorithm that approximates the distance to monotonicity within a 1 + ε factor for any fixed ε > 0 and runs in space polylogarithmic in the length of the sequence and the range of the numbers. The best previous determini...
متن کاملDistributed Almost Exact Approximations for Minor-Closed Families
We give efficient deterministic distributed algorithms which given a graph G from a proper minor-closed family C find an approximation of a minimum dominating set in G and a minimum connected dominating set in G. The algorithms are deterministic and run in a polylogarithmic number of rounds. The approximation accomplished differs from an optimal by a multiplicative factor of (1 + o(1)).
متن کاملA Distributed Minimum Cut Approximation Scheme
In this paper, we study the problem of approximating the minimum cut in a distributed message-passing model, the CONGEST model. The minimum cut problem has been well-studied in the context of centralized algorithms. However, there were no known non-trivial algorithms in the distributed model until the recent work of Ghaffari and Kuhn. They gave algorithms for finding cuts of size O(ǫλ) and (2 +...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Review
دوره 48 شماره
صفحات -
تاریخ انتشار 2000